ALGEBRAIC MODELLING OF FAULT TREES WITH PRIORITY AND GATES

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algebraic modelling of Fault Trees with Priority AND gates

This paper presents a formal framework allowing to extend the simplification of static fault trees to fault trees built with gates PRIORITY AND. The laws which make these simplifications possible have been demonstrated thanks to a homogeneous algebraic definition of each gate studied. These definitions use a mathematical model of events able to take into account their order of appearance. The p...

متن کامل

Quantification of Priority-OR Gates in Temporal Fault Trees

Fault Tree Analysis has been used in reliability engineering for many decades and has seen various modifications to enable it to analyse fault trees with dynamic and temporal gates so it can incorporate sequential failure in its analysis. Pandora is a technique that analyses fault trees logically with three temporal gates (PAND, SAND, POR) in addition to Boolean gates. However, it requires exte...

متن کامل

Process-Algebraic Modelling of Priority Queueing Networks

We consider a closed multiclass queueing network model in which each class receives a different priority level and jobs with lower priority are served only if there are no higher-priority jobs in the queue. Such systems do not enjoy a product form solution, thus their analysis is typically carried out through approximate mean value analysis (AMVA) techniques. We formalise the problem in PEPA in...

متن کامل

MODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS

Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....

متن کامل

Algebraic determination of the structure function of Dynamic Fault Trees

This paper presents an algebraic framework allowing to algebraically model dynamic gates and determine the structure function of any Dynamic Fault Tree (DFT). This structure function can then be exploited to perform both the qualitative and quantitative analysis of DFTs directly, even though this latter aspect is not detailed in this paper. We illustrate our approach on a DFT example from the l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IFAC Proceedings Volumes

سال: 2007

ISSN: 1474-6670

DOI: 10.3182/20070613-3-fr-4909.00008